Covering radius - Survey and recent results
نویسندگان
چکیده
All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear [II, k] code. There is also a recent result on the complexity of computing the covering radius.
منابع مشابه
Dynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملA multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کاملOn the covering radius of codes
Designing a good error-correcting code is a packing problem. The corresponding covering problem has received much less attention: now the codewords must be placed so that no vector of the space is very far from the nearest codeword. The two problems are quite different, and with a few exceptions good packings, i.e. codes with a large minimal distance, are usually not especially good coverings. ...
متن کاملImproved lower bounds for multicovering codes
The m-covering radius of a code is a recent generalization of the covering radius of a code. It is the smallest t such that every m-tuple of vectors is contained in a ball of Hamming radius centered at some codeword. We derive new lower bounds for the size of the smallest code that has a given length and m-covering radius.
متن کاملCovering a ball with smaller equal balls in R
We give an explicit upper bound of the minimal number νT,n of balls of radius 1/2 which form a covering of a ball of radius T > 1/2 in R , n > 2. The asymptotic estimates of νT,n we deduce when n is large are improved further by recent results of Böröczky Jr. and Wintsche on the asymptotic estimates of the minimal number of equal balls of R n covering the sphere S. The optimality of the asympto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 1985